Check If Circular Linked List

Given a singly linked list, find if the linked list is circular or not. A linked list is called circular if it not NULL terminated and all nodes are connected in the form of a cycle. An empty linked list is considered as circular Example 1: Input: LinkedList: 1->2->3->4->5 (the first and last node is connected,i.e. 5 --> 1) Output: 1 Example 2: Input: LinkedList: 2->4->6->7->5->1 Output: 0

---

        Code
        
        bool isCircular(Node *head)
        {
            Node* h=head;
            if(h==NULL)
            return 1;
            
            while(h->next!=NULL)
            {
                h=h->next;
                if(h->next==head)
                return 1;
                
            }
            return 0;
            
        }